Conditions for the convergence of evolutionary algorithms
نویسندگان
چکیده
منابع مشابه
Conditions for the convergence of evolutionary algorithms
This paper presents a theoretical analysis of the convergence conditions for evolutionary algorithms. The necessary and sufficient conditions, necessary conditions, and sufficient conditions for the convergence of evolutionary algorithms to the global optima are derived, which describe their limiting behaviors. Their relationships are explored. Upper and lower bounds of the convergence rates of...
متن کاملthe effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
Genetic Algorithms: Minimal Conditions for Convergence
This paper is concerning the finite, homogenous Markov chain modeling of the binary, elitist genetic algorithm (EGA) and provides a set of minimal sufficient conditions for convergence to the global optimum. The case of a GA where each population would be allow to mutate only a small number of bits has not been covered yet by the GA’s literature, although it commonly appears in practice. The ma...
متن کاملUsing statistical inference for designing termination conditions ensuring convergence of Evolutionary Algorithms
A main challenge in Evolutionary Algorithms (EAs) is determining a termination condition ensuring stabilization close to the optimum in real-world applications. Although for known test functions distribution-based quantities are good candidates (as far as suitable parameters are used), in real-world problems an open question still remains unsolved. How can we estimate an upper-bound for the ter...
متن کاملSufficient conditions for the local convergence of constant modulus algorithms
The constant modulus (CM) criterion has become popular in the design of blind linear estimators of sub-Gaussian i.i.d. processes transmitted through unknown linear channels in the presence of unknown additive interference. The existence of multiple CM minima, however, makes it difficult for CM-minimizing schemes to generate estimates of the desired source (as opposed to an interferer) in multiu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems Architecture
سال: 2001
ISSN: 1383-7621
DOI: 10.1016/s1383-7621(01)00018-2